Pure Decrementing Service M/G/1 Queue with Multiple Adaptive Vacations
نویسندگان
چکیده
In this paper, an M/G/1 queue model with the multiple adaptive vacations and pure decrementing service policy is studied based on the classical M/G/1 queueing model. The PGF of stationary queue length is derived by using an embedded Markov chain method. The LST of stationary waiting time is also given according to the independence between waiting time and arrival process. The average probabilities of various system states are obtained. Some special cases are given to show the general properties of the new model.
منابع مشابه
Analysis of an M/G/1 Queue with Multiple Vacations, N-policy, Unreliable Service Station and Repair Facility Failures
This paper studies an M/G/1 repairable queueing system with multiple vacations and N-policy, in which the service station is subject to occasional random breakdowns. When the service station breaks down, it is repaired by a repair facility. Moreover, the repair facility may fail during the repair period of the service station. The failed repair facility resumes repair after completion of its re...
متن کاملBat Algorithm for Optimal Service Parameters in an Impatient Customer N-Policy Vacation Queue
In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...
متن کاملFinite Buffer Bulk Service Queue with Multiple Vacations
In this paper, it is studied about finite buffer bulk service queue M/G (a,b) /1 with multiple vacations and some analytical results, relations among queue length distributions, computations of state probabilities at various epochs are included.
متن کاملRELIABILITY ANALYSIS OF M/G/1 REPAIRABLE QUEUEING SYSTEM WITH MULTIPLE ADAPTIVE VACATIONS AND p-ENTERING DISCIPLINE
This paper considers the reliability of an M/G/1 queue with multiple adaptive vacations in which the arriving customers enter the system with probability p (0<p≤1) during vacations. Through appropriate assumptions, the model is studied by the total probability decomposition technique and the tool of Laplace transform. Some reliability indices are studied. Moreover, we give some numerical exampl...
متن کاملAnalysis of a Geom/G/1 Queue with General Limited Service and MAVs
Abstract In this paper, we present an analysis for a general limited service Geom/G/1 queue model with multiple adaptive vacations (MAVs). The Probability Generating Function (P.G.F.) of the queue length is obtained by using an embedded Markov chain with a regeneration cycle approach. The P.G.F. of the waiting time is also derived based on the independence between the arrival process and the wa...
متن کامل